type github.com/andybalholm/brotli.huffmanCode

42 uses

	github.com/andybalholm/brotli (current package)
		decode.go#L331: func decodeSymbol(bits uint32, table []huffmanCode, br *bitReader) uint32 {
		decode.go#L345: func readSymbol(table []huffmanCode, br *bitReader) uint32 {
		decode.go#L351: func safeDecodeSymbol(table []huffmanCode, br *bitReader, result *uint32) bool {
		decode.go#L393: func safeReadSymbol(table []huffmanCode, br *bitReader, result *uint32) bool {
		decode.go#L404: func preloadSymbol(safe int, table []huffmanCode, br *bitReader, bits *uint32, value *uint32) {
		decode.go#L416: func readPreloadedSymbol(table []huffmanCode, br *bitReader, bits *uint32, value *uint32) uint32 {
		decode.go#L418: 	var ext []huffmanCode
		decode.go#L574: 	var p []huffmanCode
		decode.go#L613: 	var p []huffmanCode
		decode.go#L714: func readHuffmanCode(alphabet_size uint32, max_symbol uint32, table []huffmanCode, opt_table_size *uint32, s *Reader) int {
		decode.go#L845: func readBlockLength(table []huffmanCode, br *bitReader) uint32 {
		decode.go#L855: func safeReadBlockLength(s *Reader, result *uint32, table []huffmanCode, br *bitReader) bool {
		decode.go#L1166: 	s.literal_htree = []huffmanCode(s.literal_hgroup.htrees[s.context_map_slice[0]])
		decode.go#L1197: 	s.htree_command = []huffmanCode(s.insert_copy_hgroup.htrees[s.block_type_rb[3]])
		decode.go#L1503: 	var distance_tree []huffmanCode = []huffmanCode(s.distance_hgroup.htrees[s.dist_htree_index])
		decode.go#L1629: 	var hc []huffmanCode
		decode.go#L1777: 			hc = []huffmanCode(s.literal_hgroup.htrees[s.context_map_slice[context]])
		decode.go#L2179: 			s.block_type_trees = make([]huffmanCode, (3 * (huffmanMaxSize258 + huffmanMaxSize26)))
		decode.go#L2413: 				s.htree_command = []huffmanCode(s.insert_copy_hgroup.htrees[0])
		huffman.go#L68: type huffmanCode struct {
		huffman.go#L73: func constructHuffmanCode(bits byte, value uint16) huffmanCode {
		huffman.go#L74: 	var h huffmanCode
		huffman.go#L94: 	htrees        [][]huffmanCode
		huffman.go#L95: 	codes         []huffmanCode
		huffman.go#L375: func replicateValue(table []huffmanCode, step int, end int, code huffmanCode) {
		huffman.go#L402: func buildCodeLengthsHuffmanTable(table []huffmanCode, code_lengths []byte, count []uint16) {
		huffman.go#L403: 	var code huffmanCode /* current table entry */ /* symbol index in original or sorted table */ /* prefix code */ /* prefix code addend */ /* step size to replicate values in current table */ /* size of current table */ /* symbols sorted by code length */
		huffman.go#L481: func buildHuffmanTable(root_table []huffmanCode, root_bits int, symbol_lists symbolList, count []uint16) uint32 {
		huffman.go#L482: 	var code huffmanCode /* current table entry */ /* next available space in table */ /* current code length */ /* symbol index in original or sorted table */ /* prefix code */ /* prefix code addend */ /* 2nd level table prefix code */ /* 2nd level table prefix code addend */ /* step size to replicate values in current table */ /* key length of current table */ /* size of current table */ /* sum of root table size and 2nd level table sizes */
		huffman.go#L483: 	var table []huffmanCode
		huffman.go#L579: func buildSimpleHuffmanTable(table []huffmanCode, root_bits int, val []uint16, num_symbols uint32) uint32 {
		state.go#L113: 	htree_command               []huffmanCode
		state.go#L120: 	block_type_trees            []huffmanCode
		state.go#L121: 	block_len_trees             []huffmanCode
		state.go#L134: 	literal_htree               []huffmanCode
		state.go#L145: 	table                       [32]huffmanCode
		state.go#L152: 	next                        []huffmanCode
		state.go#L156: 	context_map_table           [huffmanMaxSize272]huffmanCode
		state.go#L291: 	group.htrees = make([][]huffmanCode, ntrees)
		state.go#L292: 	group.codes = make([]huffmanCode, (uint(ntrees) * max_table_size))